Line-Primitive 2-(v, k, 1) Designs with k/(k, v)<=10
نویسندگان
چکیده
A 2&(v, k, 1) design D=(P, L) is a system consisting of a finite set P of v points and a collection L of a k-subset of P, called lines, such that each 2-subset of P is contained in precisely one line. We shall always assume that 2<k<v. Let G Aut(D) be a group of automorphisms of a 2&(v, k, 1) design D. The group G is said to be line-transitive (line-primitive, respectively) on D if G is transitive (primitive, respectively) on L. The group G is said to be point-transitive ( point-primitive, respectively) on D if G is transitive (primitive, respectively) on P. A flag of D is a pair consisting of a point and a line containing this point. G is flag-transitive on D if G is transitive on the set of flags of D. The following results are well known: doi:10.1006 jcta.2000.3079, available online at http: www.idealibrary.com on
منابع مشابه
Flag-transitive point-primitive $(v,k,4)$ symmetric designs with exceptional socle of Lie type
Let $G$ be an automorphism group of a $2$-$(v,k,4)$ symmetric design $mathcal D$. In this paper, we prove that if $G$ is flag-transitive point-primitive, then the socle of $G$ cannot be an exceptional group of Lie type.
متن کاملFlag-transitive Point-primitive symmetric designs and three dimensional projective special linear groups
The main aim of this article is to study (v,k,λ)-symmetric designs admitting a flag-transitive and point-primitive automorphism group G whose socle is PSL(3,q). We indeed show that the only possible design satisfying these conditions is a Desarguesian projective plane PG(2,q) and G > PSL(3,q).
متن کاملRoman k-Tuple Domination in Graphs
For any integer $kgeq 1$ and any graph $G=(V,E)$ with minimum degree at least $k-1$, we define a function $f:Vrightarrow {0,1,2}$ as a Roman $k$-tuple dominating function on $G$ if for any vertex $v$ with $f(v)=0$ there exist at least $k$ and for any vertex $v$ with $f(v)neq 0$ at least $k-1$ vertices in its neighborhood with $f(w)=2$. The minimum weight of a Roman $k$-tuple dominatin...
متن کاملSigned total Italian k-domination in graphs
Let k ≥ 1 be an integer, and let G be a finite and simple graph with vertex set V (G). A signed total Italian k-dominating function (STIkDF) on a graph G is a functionf : V (G) → {−1, 1, 2} satisfying the conditions that $sum_{xin N(v)}f(x)ge k$ for each vertex v ∈ V (G), where N(v) is the neighborhood of $v$, and each vertex u with f(u)=-1 is adjacent to a vertex v with f(v)=2 or to two vertic...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 93 شماره
صفحات -
تاریخ انتشار 2001